answer set programming造句

例句与造句

1. This generalization has applications to answer set programming.
2. Major logic programming language families include Prolog, Answer set programming ( ASP ) and Datalog.
3. But the use of stable models in answer set programming provides a different perspective on such programs.
4. Typically, however, a translation is given from these languages to answer set programming rather than first-order logic.
5. The autoepistemic interpretation was developed further by Gelfond and Lifschitz [ 1988 ] and is the basis of answer set programming.
6. It's difficult to find answer set programming in a sentence. 用answer set programming造句挺难的
7. The autoepistemic interpretation of NAF can be combined with classical negation, as in extended logic programming and answer set programming.
8. By comparison, answer set programming is also based on predicates ( more precisely, on atomic sentences created from atomic formula ).
9. As an alternative to the completion semantics, negation as failure can also be interpreted epistemically, as in the stable model semantics of answer set programming.
10. From this point of view, logic programs with exactly one stable model are rather special in answer set programming, like polynomials with exactly one root in algebra.
11. VGDL can be used to describe a game specifically for procedural generation of levels, using Answer Set Programming ( ASP ) and an Evolutionary Algorithm ( EA ).
12. These investigations led to introduction of a form of Logic Programming called Answer Set Programming a computational knowledge representation formalism, studied both in Europe and in United States.
13. For instance, the eight queens puzzle has 92 solutions; to solve it using answer set programming, we encode it by a logic program with 92 stable models.
14. The Core Answer Set Programming Dialect ( CASPD ) is based on answer set programming, that is, declarative logic programming based on the answer set semantics ( stable model semantics ).
15. The Core Answer Set Programming Dialect ( CASPD ) is based on answer set programming, that is, declarative logic programming based on the answer set semantics ( stable model semantics ).
16. The Boolean satisfiability problem ( SAT ), the satisfiability modulo theories ( SMT ) and answer set programming ( ASP ) can be roughly thought of as certain forms of the constraint satisfaction problem.
更多例句：  下一页